Modeling and Control of Rare Segments in BitTorrent with Epidemic Dynamics

Despite its existing incentives for leecher cooperation, BitTorrent file sharing fundamentally relies on the presence of seeder peers. Seeder peers essentially operate outside the BitTorrent incentives, with two caveats: slow downlinks lead to increased numbers of "temporary" seeders (who left their console, but will terminate their seeder role when they return), and the copyright liability boon that file segmentation offers for permanent seeders. Using a simple epidemic model for a two-segment BitTorrent swarm, we focus on the BitTorrent rule to disseminate the (locally) rarest segments first. With our model, we show that the rarest-segment first rule minimizes transition time to seeder (complete file acquisition) and equalizes the segment populations in steady-state. We discuss how alternative dissemination rules may {\em beneficially increase} file acquisition times causing leechers to remain in the system longer (particularly as temporary seeders). The result is that leechers are further enticed to cooperate. This eliminates the threat of extinction of rare segments which is prevented by the needed presence of permanent seeders. Our model allows us to study the corresponding trade-offs between performance improvement, load on permanent seeders, and content availability, which we leave for future work. Finally, interpreting the two-segment model as one involving a rare segment and a "lumped" segment representing the rest, we study a model that jointly considers control of rare segments and different uplinks causing "choking," where high-uplink peers will not engage in certain transactions with low-uplink peers.Comment: 18 pages, 6 figures, A shorter version of this paper that did not include the N-segment lumped model was presented in May 2011 at IEEE ICC, Kyot

Adaptive and occupancy-based channel selection for unreliable cognitive radio networks

In this paper, we propose an adaptive and occupancy-based channel selection for unreliable cognitive radio networks

Toward Reliable Contention-aware Data Dissemination in Multi-hop Cognitive Radio Ad Hoc Networks

This paper introduces a new channel selection strategy for reliable contentionaware data dissemination in multi-hop cognitive radio network. The key challenge here is to select channels providing a good tradeoff between connectivity and contention. In other words, channels with good opportunities for communication due to (1) low primary radio nodes (PRs) activities, and (2) limited contention of cognitive ratio nodes (CRs) acceding that channel, have to be selected. Thus, by dynamically exploring residual resources on channels and by monitoring the number of CRs on a particular channel, SURF allows building a connected network with limited contention where reliable communication can take place. Through simulations, we study the performance of SURF when compared with three other related approaches. Simulation results confirm that our approach is effective in selecting the best channels for efficient and reliable multi-hop data dissemination

CSMA Local Area Networking under Dynamic Altruism

In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming "by rule" conformance to a protocol designed to regulate packet-flow rates (e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic altruism term into the net utility. The effects of altruism are analyzed at Nash equilibrium for both the ALOHA and CSMA frameworks in the quasistationary (fictitious play) regime. We consider either power or throughput based costs of networking, and the cases of identical or heterogeneous (independent) users/players. In a numerical study we consider diverse players, and we see that the effects of altruism for similar players can be beneficial in the presence of significant congestion, but excessive altruism may lead to underuse of the channel when demand is low

On the Feasibility of Social Network-based Pollution Sensing in ITSs

Intense vehicular traffic is recognized as a global societal problem, with a multifaceted influence on the quality of life of a person. Intelligent Transportation Systems (ITS) can play an important role in combating such problem, decreasing pollution levels and, consequently, their negative effects. One of the goals of ITSs, in fact, is that of controlling traffic flows, measuring traffic states, providing vehicles with routes that globally pursue low pollution conditions. How such systems measure and enforce given traffic states has been at the center of multiple research efforts in the past few years. Although many different solutions have been proposed, very limited effort has been devoted to exploring the potential of social network analysis in such context. Social networks, in general, provide direct feedback from people and, as such, potentially very valuable information. A post that tells, for example, how a person feels about pollution at a given time in a given location, could be put to good use by an environment aware ITS aiming at minimizing contaminant emissions in residential areas. This work verifies the feasibility of using pollution related social network feeds into ITS operations. In particular, it concentrates on understanding how reliable such information is, producing an analysis that confronts over 1,500,000 posts and pollution data obtained from on-the- field sensors over a one-year span.Comment: 10 pages, 15 figures, Transaction Forma

Online Load Balancing for Network Functions Virtualization

Network Functions Virtualization (NFV) aims to support service providers to deploy various services in a more agile and cost-effective way. However, the softwarization and cloudification of network functions can result in severe congestion and low network performance. In this paper, we propose a solution to address this issue. We analyze and solve the online load balancing problem using multipath routing in NFV to optimize network performance in response to the dynamic changes of user demands. In particular, we first formulate the optimization problem of load balancing as a mixed integer linear program for achieving the optimal solution. We then develop the ORBIT algorithm that solves the online load balancing problem. The performance guarantee of ORBIT is analytically proved in comparison with the optimal offline solution. The experiment results on real-world datasets show that ORBIT performs very well for distributing traffic of each service demand across multipaths without knowledge of future demands, especially under high-load conditions

Note sur les performances de TCP dans un environnement sans-fil multisaut

National audienceThis work is devoted to the behavior of TCP when it takes place in an internal multihop wireless network. We limit our study to topologies of chains. First, we evaluate the maximum throughput that a multihop path can sustain as a function of the number of TCP flows. Then, we measure the maximum throughput that a TCP flow can attain as a function of the number of hops involved in the path. Finally, we compare our results to theoretical estimates by other researchers